What's next? Judging sequences of binary events.

نویسندگان

  • An T Oskarsson
  • Leaf Van Boven
  • Gary H McClelland
  • Reid Hastie
چکیده

The authors review research on judgments of random and nonrandom sequences involving binary events with a focus on studies documenting gambler's fallacy and hot hand beliefs. The domains of judgment include random devices, births, lotteries, sports performances, stock prices, and others. After discussing existing theories of sequence judgments, the authors conclude that in many everyday settings people have naive complex models of the mechanisms they believe generate observed events, and they rely on these models for explanations, predictions, and other inferences about event sequences. The authors next introduce an explanation-based, mental models framework for describing people's beliefs about binary sequences, based on 4 perceived characteristics of the sequence generator: randomness, intentionality, control, and goal complexity. Furthermore, they propose a Markov process framework as a useful theoretical notation for the description of mental models and for the analysis of actual event sequences.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Methods to Construct Golay Complementary Sequences Over the QAM Constellation

In this paper, based on binary Golay complementary sequences, we propose some methods to construct Golay complementary sequences of length 2 for integer n, over the M-QAM constellation and 2M -Q-PAM constellations ,where M = 2 for integer m . A method to judge whether a sequence constructed using the new general offset pairs over the QAM constellation is Golay complementary sequence is proposed...

متن کامل

Limits of Computational Learning

3, 5, 7, 11, 13, . . . what's next? What general rule (apparently) produces this sequence? Maybe the sequence lists all the odd primes, but what if the next datum is 15? Maybe all odd numbers that are not squares? In this course we will study learning (identi cation) of in nite objects (such as in nite sequences) from nite data (such as initial pieces of the sequence), also known as Inductive I...

متن کامل

IRiS: Construction of ARG networks at genomic scales

SUMMARY Given a set of extant haplotypes IRiS first detects high confidence recombination events in their shared genealogy. Next using the local sequence topology defined by each detected event, it integrates these recombinations into an ancestral recombination graph. While the current system has been calibrated for human population data, it is easily extendible to other species as well. AVAI...

متن کامل

Recognizing predictive patterns in chaotic maps

We investigate the existence of rules (in the form of binary patterns) that allow the short-term prediction of highly complex binary sequences. We also study the extent to which these rules retain their predictive power when the sequence is contaminated with noise. Complex binary sequences are derived by applying two binary transformations on realvalued sequences generated by the well known ten...

متن کامل

A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously

Pallo and Wu et al. respectively introduced the left-weight sequences (LW-sequences) and right-weight sequences (RW-sequences) for representing binary trees. In this paper, we introduce two new types of binary tree sequences called the left-child sequences (LC-sequences) and right-child sequences (RC-sequences). Next, we propose a loopless algorithm associated with rotations of binary trees for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Psychological bulletin

دوره 135 2  شماره 

صفحات  -

تاریخ انتشار 2009